Deformations of associahedra and visibility graphs

نویسندگان

  • Satyan Devadoss
  • Rahul Shah
  • Xuancheng Shao
  • Ezra Winston
چکیده

Given an arbitrary polygon P with holes, we construct a polytopal complex analogous to the associahedron based on convex diagonalizations of P . This polytopal complex is shown to be contractible, and a geometric realization is provided based on the theory of secondary polytopes. We then reformulate a combinatorial deformation theory and present an open problem based on visibility which is a close cousin to the Carpenter’s Rule theorem of computational geometry.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudograph associahedra

Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associahedra in a general context, for pseudographs with loops and multiple edges, which are also allowed to be disconnected. We then consider deformations of pseudograph associahedra as their underlying graphs are altered by ...

متن کامل

Visibility Graphs and Deformations of Associahedra

The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P , we construct a polytopal complex analogous to the associahedron based on convex diagonalizations of P . We describe topological properties of this complex and provide realizations based on secondary polytopes. Moreover, using the...

متن کامل

ar X iv : m at h / 06 09 18 4 v 1 [ m at h . C O ] 6 S ep 2 00 6 FACES OF GENERALIZED PERMUTOHEDRA

The aim of the paper is to calculate face numbers of simple generalized permutohedra, and study their f -, hand γ-vectors. These polytopes include permutohedra, associahedra, graph-associahedra, graphical zonotopes, nestohedra, and other interesting polytopes. We give several explicit formulas involving descent statistics, calculate generating functions and discuss their relationship with Simon...

متن کامل

A Note on the Combinatorial Structure of the Visibility Graph in Simple Polygons

Combinatorial structure of visibility is probably one of the most fascinating and interesting areas of engineering and computer science. The usefulness of visibility graphs in computational geometry and robotic navigation problems like motion planning, unknown-terrain learning, shortest-path planning, etc., cannot be overstressed. The visibility graph, apart from being an important data structu...

متن کامل

Inequalities between Gamma-Polynomials of Graph-Associahedra

We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with n vertices that induces inequalities between the γ-polynomials of their associated graph-associahedra. The partial order is given by relating trees that can be obtained from one another by operations called tree shifts. We also show that tree shifts lower the γ-polynomials of graph...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Contributions to Discrete Mathematics

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012